Higher-order Contingent Derivative of Perturbation Maps in Multiobjective Optimization
نویسندگان
چکیده
In this paper, higher-order sensitivity analysis in multiobjective optimization problem is considered. First, relations between higher-order contingent derivative, or their minima, of a set-valued map and its profile map are investigated. Then, properties of higher-order contingent derivatives of the perturbation maps of a parameterized optimization problem are obtained.
منابع مشابه
Second-Order Contingent Derivative of the Perturbation Map in Multiobjective Optimization
Here, u is a p-dimensional decision variable, x is an n-dimensional parameter vector, X is a nonempty set-valued map from R to R, which specifies a feasible decision set, and f is an objective map from R × R to R, wherem, n, p are positive integers. The norms of all finite dimensional spaces are denoted by ‖ · ‖. C is a closed convex pointed cone with nonempty interior in R. The cone C induces ...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملGeneralized second-order contingent epiderivatives in parametric vector optimization problems
This paper is concerned with generalized second-order contingent epiderivatives of frontier and solution maps in parametric vector optimization problems. Under some mild conditions, we obtain some formulas for computing generalized second-order contingent epiderivatives of frontier and solution maps, respectively. We also give some examples to illustrate the corresponding results.
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملHigher-Order Weakly Generalized Epiderivatives and Applications to Optimality Conditions
The notions of higher-order weakly generalized contingent epiderivative and higher-order weakly generalized adjacent epiderivative for set-valued maps are proposed. By virtue of the higher-order weakly generalized contingent adjacent epiderivatives, both necessary and sufficient optimality conditions are obtained for Henig efficient solutions to a set-valued optimization problem whose constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015